The Proof-assistant
نویسنده
چکیده
Yarrow is an interactive proof assistant based on the theory of Pure Type Systems, a family of typed lambda calculi. Yarrow has been designed as a exible environment for experimentation with various typed lambda calculi. It ooers both graphical and textual interfaces. It has been coded entirely in Haskell, making use of the Fudget library for the graphical interface. In this paper we concentrate on the software architecture of Yarrow, in particular the use of monads, the coupling of user interface and proof engine, polymorphic output routines, and exible representations of lambda terms. We also treat the presentation of proofs in the ag-style format.
منابع مشابه
A new proof for the Banach-Zarecki theorem: A light on integrability and continuity
To demonstrate more visibly the close relation between thecontinuity and integrability, a new proof for the Banach-Zareckitheorem is presented on the basis of the Radon-Nikodym theoremwhich emphasizes on measure-type properties of the Lebesgueintegral. The Banach-Zarecki theorem says that a real-valuedfunction $F$ is absolutely continuous on a finite closed intervalif and only if it is continuo...
متن کاملNovel Didactic Proof Assistant for First-Order Logic Natural Deduction
We present a proof assistant designed to help learning formal proof, particularly in the system of Natural Deduction for First-Order Logic. The assistant handles formulas and derivations containing metavariables and allows to maintain a library of instanciable lemmas. It possesses a graphical interface presenting proofs as trees and handles multiple simultaneous derivations that can be dragged ...
متن کاملAccurate Summation: Towards a Simpler and Formal Proof
This paper provides a simpler proof of the “accurate summation” algorithm proposed by Demmel and Hida in [1]. It also gives improved bounds in some cases, and examples showing that those new bounds are optimal. This simpler proof will be used to obtain a computer-generated proof of Demmel-Hida’s algorithm, using a proof assistant like HOL, PVS or Coq.
متن کاملMathematical Libraries as Proof Assistant Environments
In this paper we analyse the modifications on logical operations — as proof checking, type inference, reduction and convertibility — that are required for the identification of a proof assistant environment with a distributed mathematical library, focusing on proof assistants based on the Curry-Howard isomorphism. This identification is aimed at the integration of Mathematical Knowledge Managem...
متن کاملPanda: A Proof Assistant in Natural Deduction for All. A Gentzen Style Proof Assistant for Undergraduate Students
We present a proof assistant in Natural Deduction for undergraduate students. The system is interactive: you can combine, delete, modify proofs with a easy-to-use graphical interface. We discuss the pedagogical benefit of this tool.
متن کامل